Primal clusters
نویسندگان
چکیده
منابع مشابه
On Primal and Weakly Primal Ideals over Commutative Semirings
Since the theory of ideals plays an important role in the theory of semirings, in this paper we will make an intensive study of the notions of primal and weakly primal ideals in commutative semirings with an identity 1. It is shown that these notions inherit most of the essential properties of the primal and weakly primal ideals of a commutative ring with non-zero identity. Also, the relationsh...
متن کاملPrimal strong co-ideals in semirings
In this paper, we introduce the notion of primal strong co-ideals and give some results involving them. It is shown thatsubtractive strong co-ideals are intersection of all primal strong co-ideals that contain them. Also we prove that the representation of strong co-ideals as reduced intersections of primal strong co-ideals is unique.
متن کاملBasic primal infon logic
Primal infon logic (PIL) was introduced in 2009 in the framework of policy and trust management. In the meantime, some generalizations appeared, and there have been some changes in the syntax of the basic PIL. This paper is on the basic PIL, and one of our purposes is to “institutionalize” the changes. We prove a small-model theorem for the propositional fragment of basic primal infon logic (PP...
متن کاملPrimal separation algorithms
Given an integer polyhedron PI ⊂ R, an integer point x̄ ∈ PI , and a point x∗ ∈ R \ PI , the primal separation problem is the problem of finding a linear inequality which is valid for PI , violated by x∗, and satisfied at equality by x̄. The primal separation problem plays a key role in the primal approach to integer programming. In this paper we examine the complexity of primal separation for se...
متن کاملTransitive Primal Infon Logic
Primal infon logic was introduced in 2009 in connection with access control. In addition to traditional logic constructs, it contains unary connectives p said indispensable in the intended access control applications. Propositional primal infon logic is decidable in linear time, yet suffices for many common access control scenarios. The most obvious limitation on its expressivity is the failure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1966
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1966.16.379